Independence concepts in evidence theory: some results about epistemic irrelevance and imprecise belief functions

نویسنده

  • Sebastien Destercke
چکیده

Many extensions of classical stochastic independence have been proposed when working with probability sets to represent uncertainty. As belief functions can be seen as particular instances of such probability sets, some authors have investigated how these extensions can be reinterpreted and retrieved in the particular framework of belief functions. They have mainly focused on the so-called notions of random set independence, fuzzy non-interaction, strong independence and unknown interaction. In this paper, we pursue this effort in two ways: first by showing that the notion of epistemic irrelevance, central in Walley theory of lower previsions, can be likewise reinterpreted in terms of belief functions; second by considering the more general case where mass assignments inducing belief functions are themselves imprecise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relating Epistemic Irrelevance to Event Trees

We relate the epistemic irrelevance in Walley’s behavioural theory of imprecise probabilities to the event-tree independence due to Shafer. In particular, we show that forward irrelevance is equivalent to event-tree independence in particular event trees, suitably generalised to allow for the fact that imprecise rather than precise probability models are attached to the nodes in the tree. This ...

متن کامل

Independence Concepts for Belief Functions

In this paper, we try to study the independence concept for belief functions theory, as applied to one interpretation of this theory called the transferable belief model (TBM). In this context, two new results are given in this paper : first, the concept of belief function independence has different intuitive meaning which are non-interactivity, irrelevance and doxastic independence, second, th...

متن کامل

Probabilistic Inference in Credal Networks: New Complexity Results

Credal networks are graph-based statistical models whose parameters take values in a set, instead of being sharply specified as in traditional statistical models (e.g., Bayesian networks). The computational complexity of inferences on such models depends on the irrelevance/independence concept adopted. In this paper, we study inferential complexity under the concepts of epistemic irrelevance an...

متن کامل

Credal nets under epistemic irrelevance

We present a new approach to credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. Instead of applying the commonly used notion of strong independence, we replace it by the weaker notion of epistemic irrelevance. We show how assessments of epistemic irrelevance allow us to construct a global model out of given local uncertainty models and mention some u...

متن کامل

Belief function independence: I. The marginal case

In this paper, we study the notion of marginal independence between two sets of variables when uncertainty is expressed by belief functions as understood in the context of the transferable belief model. We define the concepts of non-interactivity and irrelevance, that are not equivalent. Doxastic independence for belief functions is defined as irrelevance and irrelevance preservation under Demp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010